Skeleton Simplification by Key Points Identification
نویسندگان
چکیده
The current skeletonisation algorithms, based on thinning, extract the morphological features of an object in an image but the skeletonized objects are coarsely presented. This paper proposes an algorithm which goes beyond that approach by changing the coarse line segments into perfect “straight” line segments, obtaining points, angles, line segment size and proportions. Our technique is applied in the postprocessing phase of the skeleton, which improves it no matter which skeletonisation technique is used, as long as the structure is made with one-pixel width continuous line segments. This proposal is a first step towards human activity recognition through the analysis of human poses represented by their skeletons.
منابع مشابه
Patch-type Segmentation of Voxel Shapes using Simplified Surface Skeletons
We present a new method for decomposing a 3D voxel shape into disjoint segments using the shape’s simplified surface-skeleton. The surface skeleton of a shape consists of 2D manifolds inside its volume. Each skeleton point has a maximally inscribed ball that touches the boundary in at least two contact points. A key observation is that the boundaries of the simplified foreand background skeleto...
متن کامل3D Mesh Skeleton Extraction Using Topological and Geometrical Analyses
This paper describes a novel and unified approach for Reeb graph construction and simplification as well as constriction approximation on 3D polygonal meshes. The key idea of our algorithm is that discrete contours – curves carried by the edges of the mesh and approximating the continuous contours of a mapping function – encode both topological and geometrical shape characteristics. Firstly, me...
متن کاملExploring the use of Reeb graphs in LOD generation
Level of detail was one of the fundamental solutions of simplification 3D scene. But some issues with this solution are present. For example the topology of the mesh is not kept. In this paper we introduce the Reeb graph in level of detail. Reeb graph is a topological extractor for graph. We extract the most important point of a mesh and use them as LOD. These points are representing by a skele...
متن کاملHeuristic Process Model Simplification in Frequency Response Domain
Frequency response diagrams of a system include detailed and recognizable information about the structural and parameter effects of the transfer function model of the system. The information are qualitatively and quantitatively obtainable from simultaneous consideration of amplitude ratio and phase information. In this paper, some rules and relationships are presented for making use of frequenc...
متن کاملA New Approach to Line Simplification Based on Image Processing: A Case Study of Water Area Boundaries
Line simplification is an important component of map generalization. In recent years, algorithms for line simplification have been widely researched, and most of them are based on vector data. However, with the increasing development of computer vision, analysing and processing information from unstructured image data is both meaningful and challenging. Therefore, in this paper, we present a ne...
متن کامل